With this note we bring again into attention a vector dual problem neglectedby the contributions who have recently announced the successful healing of thetrouble encountered by the classical duals to the classical linear vectoroptimization problem. This vector dual problem has, different to the mentionedworks which are of set-valued nature, a vector objective function. Weak, strongand converse duality for this "new-old" vector dual problem are proven and wealso investigate its connections to other vector duals considered in the sameframework in the literature. We also show that the efficient solutions of theclassical linear vector optimization problem coincide with its properlyefficient solutions (in any sense) when the image space is partially ordered bya nontrivial pointed closed convex cone, too.
展开▼
